From Well-Quasi-Ordered Sets to Better-Quasi-Ordered Sets
نویسندگان
چکیده
We consider conditions which force a well-quasi-ordered poset (wqo) to be betterquasi-ordered (bqo). In particular we obtain that if a poset P is wqo and the set Sω(P ) of strictly increasing sequences of elements of P is bqo under domination, then P is bqo. As a consequence, we get the same conclusion if Sω(P ) is replaced by J (P ), the collection of non-principal ideals of P , or by AM(P ), the collection of maximal antichains of P ordered by domination. It then follows that an interval order which is wqo is in fact bqo.
منابع مشابه
Poset algebras over well quasi-ordered posets
A new class of partial order-types, class G bqo is defined and investigated here. A poset P is in the class G bqo iff the poset algebra F (P ) is generated by a better quasi-order G that is included in L(P ). The free Boolean algebra F (P ) and its free distrivutive lattice L(P ) were defined in [ABKR]. The free Boolean algebra F (P ) contains the partial order P and is generated by it: F (P ) ...
متن کاملWell (and better) quasi-ordered transition systems
In this paper, we give a step by step introduction to the theory of well quasi-ordered transition systems. The framework combines two concepts, namely (i) transition systems which are monotonic wrt. a well-quasi ordering; and (ii) a scheme for symbolic backward reachability analysis. We describe several models with infinitestate spaces, which can be analyzed within the framework, e.g., Petri ne...
متن کاملBetter Quasi-Ordered Transition Systems
Many existing algorithms for model checking of infinite-state systems operate on constraints which are used to represent (potentially infinite) sets of states. A general powerful technique which can be employed for proving termination of these algorithms is that of well quasi-orderings. Several methodologies have been proposed for derivation of new well quasi-ordered constraint systems. However...
متن کاملUsing Quasi Ordered Sets to Model Program Properties Denotationally
Properties of programs are often not expressible with the standard de-notational semantics approach. Annotated semantic domains and corresponding semantic functions capacitate us to express the properties, but the resulting structures are no longer partial ordered sets. Instead we obtain quasi ordered sets, which lack the antiisymmetry which is present in partially ordered sets. In order to cat...
متن کاملFixed Points in Metrified Quasi Ordered Sets: Modelling Escaping in Functional Programs
The standard denotational semantics of a programming language, being based on Tarski’s Theorem, is often not capable of expressing program properties. Annotated semantic domains and corresponding semantic functions capacitate us to express the properties, but the resulting structures may no longer be partially ordered sets. Instead we obtain quasi ordered sets, which lack the antisymmetry of pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 13 شماره
صفحات -
تاریخ انتشار 2006